High-Speed Target Detection Algorithm Based on Sparse Fourier Transform
نویسندگان
چکیده
منابع مشابه
Sparse Fourier Transform via Butterfly Algorithm
We introduce a fast algorithm for computing sparse Fourier transforms supported on smooth curves or surfaces. This problem appear naturally in several important problems in wave scattering and reflection seismology. The main observation is that the interaction between a frequency region and a spatial region is approximately low rank if the product of their radii are bounded by the maximum frequ...
متن کاملHigh Performance Sparse Fast Fourier Transform
The Sparse Fast Fourier Transform is a recent algorithm developed by Hassanieh et al. at MIT for Discrete Fourier Transforms on signals with a sparse frequency domain. A reference implementation of the algorithm exists and proves that the Sparse Fast Fourier Transform can be faster than modern FFT libraries. However, the reference implementation does not take advantage of modern hardware featur...
متن کاملAn Efficient High-Dimensional Sparse Fourier Transform
We propose RSFT, which is an extension of the one dimensional Sparse Fourier Transform algorithm to higher dimensions in a way that it can be applied to real, noisy data. The RSFT allows for off-grid frequencies. Furthermore, by incorporating Neyman-Pearson detection, the frequency detection stages in RSFT do not require knowledge of the exact sparsity of the signal and are more robust to noise...
متن کاملDetection of high impedance faults in distribution networks using Discrete Fourier Transform
In this paper, a new method for extracting dynamic properties for High Impedance Fault (HIF) detection using discrete Fourier transform (DFT) is proposed. Unlike conventional methods that use features extracted from data windows after fault to detect high impedance fault, in the proposed method, using the disturbance detection algorithm in the network, the normalized changes of the selected fea...
متن کاملA Sublinear Algorithm of Sparse Fourier Transform for Nonequispaced Data
Nonequispaced Data Jing Zou 12th August 2005 Abstract We present a sublinear randomized algorithm to compute a sparse Fourier transform for nonequispaced data. More precisely, we address the situation where a signal is known to consist of equispaced samples, of which only are available. This includes the case of “equispaced data with gaps”; if the ratio is smaller than 1, the available data are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2853180